Nuprl Lemma : rframe-rule 11,40

i:Id, L:(Knd List), x:Id.
@i: only members of L read x 
realizes es.
k:Knd. (hasloc(k;i))  ((k  L))  es-independent(es;i;k;x
latex


Definitionsx:AB(x), P  Q, x:AB(x), a < b, Void, False, A, A  B, Id, , t  T, {x:AB(x)} , , Knd, #$n, True, (x  l), KindDeq, deq-member(eq;x;L), b, Type, , P  Q, x:A  B(x), P & Q, P  Q, {T}, f(x), x  dom(f), z != f(x P(a;z), M.rframe(k reads x), MsgA, , if b then t else f fi , , w.T, f(a), s = t, w.TA, x.A(x), <ab>, product-deq(A;B;a;b), E, Msg, type List, Unit, left + right, hasloc(k;i), A c B, mk-ma, x : v, f(x)?z, only members of L read x, M.ds(x), M.bframe(k sends on l), M(i), @i: only members of L read x, M.aframe(k affects x), M.sframe(k sends <l,tg>), M.frame(k affects x), M.send(k;l;s;v;ms;i), M.ef(k,x,s,v,w), M.pre(a,s), M.init(x,v), PossibleWorld(D;w), time(e), es-T(es), es-Choose(es), es-V(es), es-M(es), es-Send(es), es-Trans(es), es_vartype(es;i;x), Choose(i), kindtype(i;k), Send(i), s1  s2 mod x@i, Trans(i), es_state(es;i), es-independent(es;i;k;x), ES(the_w), FairFifo, World, D realizes2 es.P(es), es is an event system of D, ES, xt(x), D realizes esP(es), vartype(i;x), Msg(M), Msg, locl(a), S  T, IdLnk, w.M, suptype(ST), rcv(l,tg), outr(x), b, , a = b, tag(k), lnk(k), act(k), islocal(k), isrcv(k), kindcase(ka.f(a); l,t.g(l;t) ), w-kindtype(TA;M;i), w-automaton(T;TA;M), w-machine(w;i), w-machine-independent(w;i;k;x)
Lemmasassert-hasloc, eqtt to assert, eqff to assert, iff transitivity, assert of bnot, assert-eq-id, eq id wf, bool wf, bnot wf, rcv wf, false wf, w-TA wf, rationals wf, w-vartype wf, w-Msg wf, locl wf, IdLnk wf, w-M wf, nat wf, unit wf, w-T wf, int inc rationals, Knd wf, Id wf, d-realizes2-implies-realizes, d-single-rframe wf, es-independent wf, event system wf, d-es wf, world wf, fair-fifo wf, possible-world wf, hasloc wf, not wf, l member wf, eq id self, not functionality wrt iff, implies functionality wrt iff, assert-deq-member, assert wf, deq-member wf, Kind-deq wf, true wf, le wf

origin